Self-Organizing Sequential Search Heuristics
نویسندگان
چکیده
The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilistically. In this article,, we use amortization to analyze the heuristics in a worst-case sense; the relative merit of the heuristics in this analysis is different in the probabilistic analyses. Experiments show that the behavior of the heuristics on real data is more closely described by the amortized analyses than by the probabilistic analyses.
منابع مشابه
Self-organizing News Self-organizing News Self-organizing News Thesis Readers
Automatic newspaper design requires feature organization. An intermediary between an article database and the graphic designer is implemented that organizes features with regard to their style and content. Topics are determined and style assessed through simple keyword analysis augmented by various content-understanding heuristics. Articles are grouped by two means: comparison against predefine...
متن کاملA Locally Adaptive Data
A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for self-organizing sequential search and on variable-length encodings of integers. We prove that it never performs much worse than Huffman coding and can perform subst...
متن کاملOn the Markov chain for the move-to-root rule for binary search trees
The move-to-root (MTR) heuristic is a self-organizing rule which attempts to keep a binary search tree in near-optimal form. It is a tree analogue of the move-to-front (MTF) scheme for self-organizing lists. Both heuristics can be modeled as Markov chains. We show that the MTR chain can be derived by lumping the MTF chain and give exact formulas for the transition probabilities and stationary d...
متن کاملOnline Algorithms for Self-Organizing Sequential Search - A Survey
The main objective of this survey is to present the important theoretical and experimental results contributed till date in the area of online algorithms for the self organizing sequential search problem, also popularly known as the List Update Problem(LUP) in a chronological way. The survey includes competitiveness results of deterministic and randomized online algorithms and complexity result...
متن کاملState-transitive Markov processes, random walks on groups, and self-organizing data structures
We prove the optimality of the move-to-front rule in the class of on-line selforganizing sequential search heuristics for data structures, taking advantage of the fact that the sequence of requested items is a Markov chain F whose symmetry group GF acts transitively on the set S of items (F is then said to be state-transitive ). We state corresponding general results on controlled Markov chains...
متن کامل